cawmp+spec dict
- uses top-down simplest specs connecting to a query
	- when enter query, matches to or requires a new spec set to be entered (and reduces to others in the dict)
	- simplest data is e.g. "a","b","c",1,2,3
	- a cut-off: uses a version of types with variables (where types help functionally recognise spec from general data and variables are used to match other instances of the variable) - using simpler data may be easier
	- might be better than language recogniser->fn user because is based on specs along way rather than complex connections, or:	
		- could use code to e.g. recognise string with KNN and backwards x can just do changes to data oneself
		- 
	- finds recursive code using pf
	
	- during-program questions and data types entered as data
	- " graphics "
	- " data structures such as essay format "
	- " language from sent spec " with items in spec set dict with language in them
		- not cheating because might be quicker to specify way with same spec, makes finding preds quicker because they are labelled, might need fns to create spec sets
			- creates spec sets by decomposing list
			- recog data structures with same pattern, i.e. ordered, with a grammar, etc.
		
		- can write functional grammars by constructing them in list prolog
		
Cawp preds in dict are fnal